Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
Exploiting dominance conditions for computing worst-case time upper bounds in bounded combinatorial optimization problems: application to MIN SET COVERING and MAX CUT1
In the design of branch and bound methods for NP-hard combinatorial optimization problems, dominance conditions have always been applied. In this work we show how the use of dominance conditions within search tree algorithms can lead to non trivial worst-case upper time bounds for the considered algorithms on bounded combinatorial optimization problems. We consider here the MIN 3-SET COVERING p...
متن کاملExploiting dominance conditions for computing worst-case time upper bounds in bounded combinatorial optimization problems:application to MIN SET COVERING and MAX CUT
In the design of branch and bound methods for NP-hard combinatorial optimization problems, dominance conditions have always been applied. In this work we show how the use of dominance conditions within search tree algorithms can lead to non trivial worst-case upper time bounds for the considered algorithms on bounded combinatorial optimization problems. We consider here the MIN 3-SET COVERING p...
متن کاملOptimality Conditions and Complexity for Non-Lipschitz Constrained Optimization Problems
In this paper, we consider a class of nonsmooth, nonconvex constrained optimization problems where the objective function may be not Lipschitz continuous and the feasible set is a general closed convex set. Using the theory of the generalized directional derivative and the Clarke tangent cone, we derive a first order necessary optimality condition for local minimizers of the problem, and define...
متن کاملDominance rules in combinatorial optimization problems
The aim of this paper is to study the concept of a “dominance rule” in the context of combinatorial optimization. A dominance rule is established in order to reduce the solution space of a problem by adding new constraints to it, either in a procedure that aims to reduce the domains of variables, or directly in building interesting solutions. Dominance rules have been extensively used over the ...
متن کاملBeyond Worst-Case Analysis in Combinatorial Optimization
Traditionally, the theory of algorithms has focused on the analysis of worst-case instances. While this has led to a thorough understanding of a wide variety of problems, there are many problems for which worst-case analysis is not useful for empirical or real-world instances. A rapidly developing line of research, the so-called beyond worst-case analysis of algorithms, considers the design and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2008
ISSN: 1109-2858,1866-1505
DOI: 10.1007/s12351-008-0020-8